The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained. 得到了扇和完全等二部图联图的边色数。
A note of the adjacent vertex-distinguishing total chromatic number of k-cube graph; k-方体图邻点可区别全色数(英文)
Adjacent vertex-distinguish incidence chromatic number of crown graph 皇冠图G(n,m)的邻点可区别关联色数
On the Equitable Total Chromatic Number of Mycielski Graph of Circle Graph 圈的Mycielski图的均匀全染色
Note on the Chromatic Equivalence class of Graph 关于色等价图簇的注记
The circular chromatic number and the fractional chromatic number are two generalizations of the ordinary chromatic number of a graph. 圆色数和分式色数是图的点色数的两个推广。
On the Star Chromatic Function of Graph 关于图的星色函数
We also investigate chromatic polymial of graph by its cyclomatie number, and verify unimodality of chromatic polymial of some graph. 我们又用基回数考察了图的色多项式,验证了某些图类的色多项式的单峰性。
Computation of chromatic polynomial on double-cycles graph 双圈图的色多项式的计算
A Problem Concerning With the Chromatic-index Critical Graph 关于边着色临界图的一个问题
Application of Chromatic Theory of Graph in the Study of Scheduling Times of AGVS 图的着色理论在自动导引小车调度规划系统中的应用
The strong adjacent edge chromatic number of outerplanar graph 外平面图的邻强边色数
The game chromatic number of a graph was introduced by Bodlaender [ 1] Recently, Chou, Wang and Zhu put forward a new concept-the relaxed game chromatic number of graph in [ 2]. 一个图的竞赛色数是由Bodlaender[1]首次提出的。最近,周,王,朱在文献[2]中提出了松弛竞赛色数的概念,此概念在图论中占有很重要的地位。
The paper gives a vertex chromatic graph for any infinite group, each of whose subgroup is automorphic subgroup conducted by the chromatic graph. 本文给出任何有限群的一个顶点着色图,而这个群的每一个子群是同构于该有色图诱导出的自同构子群。
In this paper, the vertex strong total chromatic of K_4-minor free graph and outerplanar graph are studied. 本文研究了K4-minorfree图和外平面图的点强全色数。
Alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2. We also show strong edge chromatic number of two types of regular graphs with high degree and a note on a result of A. Alon提出的任何一个图的无圈边色数不超过其最大度加2的猜想。给出了两类高度正则图的强边色数,并对A。
The Chromatic Index of a Graph of Core with Cycle Rank Two 核的圈秩为2的图的边色数
Uniqueness of chromatic polynomial about derivative graph of nine order profile diagram 9阶轮图的一个派生图的色多项式唯一性的证明
In order to determine whether exist chromatic index critical graph of order 14, we should determine chromatic index critical of order 13 at first. 要想确定是否存在14阶色指数临界图,首先需要确定出13阶临界图的结构和特征。这篇论文的主要目的就是确定所有的13阶色指数临界图。
The edge chromatic number and equitable total chromatic number of join graph of star and complete bipartite graph is obtained in this paper. 本文得到了m+1阶星和完全等二部图联图的边色数和均匀全色数。
Starting from the the chromatic polynomial of a graph, the author obtains some of its subgraph enumeration algorithms. 从图的色多项式出发,我们得到了图的某些子图计数算法。
In this paper we gave four critical definitions about the chromatic index of a graph, and discussed the relations among them. 本文给出图的边色数的四种临界概念,并研究它们之间的相互关系。
The adjacent vertex-distinguishing edge chromatic number of join graph of wheel Wm and wheel Wn is obtained in this paper, where Wm, Wn denote wheels with order m+ 1 and wheels with order n+ 1, respectively. 得到了Wm∨Wn的邻点可区别边色数,其中Wm与Wn分别表示m+1阶和n+1阶的轮,Wm∨Wn表示Wm和Wn的联图。
The Coloring and Chromatic Sum of Graph 图的着色与色和
A note of Goldberg problem of edge chromatic number of a graph 关于边色数GOLDBERG问题的注记
Generalized Chromatic Number of a Graph and its Complementary Graph 图与补图的一种广义色数
On the Total Harmonious Chromatic Number of a Graph 图的全谐调着色数
We have obtained the chromatic polynomial of a graph G whose complement is the union of a complete bipartite graph and an empty graph by the ideal subgraph, and discussed the chromatic uniqueness of G. 依据理想子图的概念,得到了其补图为完全偶图及空图之并的图的色多项式,并讨论了这种图的色唯一性。
An Upper Bound on the Chromatic Number of Graph 图的色数的一个上界